Efficient Multiobjective Genetic Algorithm for Solving Transportation, Assignment, and Transshipment Problems
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm for Solving Berth and Quay Cranes Assignment problems
The management of a container terminal is a complex process that involves a vast number of decisions. The berth is the most important resource that affects the capacity of the terminal. The problem is here to allocate berths to arriving vessels and to determine which cranes in the berths process the docked vessels. For creating the berth schedule, the calling schedule of vessels, favourable ber...
متن کاملSolving Fully Interval Transshipment Problems
A new method namely, splitting method is proposed for finding an optimal solution to a transshipment problem in which all parameters are real intervals. With the help of a numerical example, the proposed method is illustrated. The splitting method is extended to fully fuzzy transshipment problems. Mathematical Subject Classification: 03E72
متن کاملSolving Multiobjective Optimization Problems using Evolutionary Algorithm
Being capable of finding a set of pareto–optimal solutions in a single run, which is a necessary feature for multi–criteria decision making, Evolutionary Algorithms (EAs) has attracted many researchers and practitioners to address the solution of Multiobjective Optimization Problems (MOPs). In a previous work, we developed a Pareto Differential Evolution (PDE) algorithm to handle multiobjective...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملgenetic algorithm based on explicit memory for solving dynamic problems
nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2012
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2012.31015